A complexity analysis of smart pixel switching nodes for photonic extended generalized shuffle switching networks
نویسندگان
چکیده
منابع مشابه
A Complexity Analysis of Smart Pixel Switching Nodes for Photonic Extended Generalized Shuffle Switching Networks
This paper studies the architectural tradeoffs found in the use of smart pixels for nodes within photonic switching interconnection networks. The particular networks of interest within the analysis are strictly nonblocking extended generalized shuffle (EGS) networks. Several performance metrics are defined for the analysis and the effect of node size on these metrics is studied. Optimum node si...
متن کاملArchitectural considerations for photonic switching networks
This paper will review some of the photonic technologies that could become important components of future telecommunications systems. It will begin by dividing photonic devices and systems into two classes according to the function they perform. The first class, relational, will be associated with devices, which under external control, maps the input channels to the output channels. The second ...
متن کاملGeneralized Load Sharing for Packet-Switching Networks
In this paper; we propose a framework to study how to effectively perform load sharing in multipath coinnumication networks. A generalized load sharing (GLS) model has been developed to conceptualize how trafic is split ideally on a set of active paths. A simple trafic splitting algorithm, called weighted fair routing ( WFR), has been developed at two different granularity levels, namely, the p...
متن کاملExtended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
Since Clos gave the first construction of a strictly nonblocking multistage interconnection network, only a few other constructions have been proposed in almost a half-century. In this paper, we introduce a constructive class of networks which utilizes crossbars of virtually any size and for which the sizes can vary from stage to stage. The interconnection between stages is a generalized shuffl...
متن کاملA General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks
The graph representation G(M) of a multistage switching network M is well known. Lea [IEEE Trans Commun 38 (1990), 529–538] observed that link-disjoint paths in M correspond to node-disjoint paths in G(M). He proposed G(M) as a network by treating nodes as crossbars to transfer the node-disjoint property to the crosstalk-free property essential for photonic networks using directional couplers a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Quantum Electronics
سال: 1993
ISSN: 0018-9197
DOI: 10.1109/3.199317